Web-dendritic ribbon growth

A web furnace was constructed for pulling dendritic-web samples. The effect of changes in the furnace thermal geometry on the growth of dendritic-web was studied. Several attempts were made to grow primitive dendrites for use as the dendritic seed crystals for web growth and to determine the optimum twin spacing in the dendritic seed crystal for web growth. Mathematical models and computer programs were used to determine the thermal geometries in the susceptor, crucible melt, meniscus, and web. Several geometries were determined for particular furnace geometries and growth conditions. The information obtained was used in conjunction with results from the experimental growth investigations in order to achieve proper conditions for sustained pulling of two dendrite web ribbons. In addition, the facilities for obtaining the following data were constructed: twin spacing, dislocation density, web geometry, resistivity, majority charge carrier type, and minority carrier lifetime

Viking '75 spacecraft design and test summary. Volume 1: Lander design

The Viking Mars program is summarized. The design of the Viking lander spacecraft is described

Viking '75 spacecraft design and test summary. Volume 3: Engineering test summary

The engineering test program for the lander and the orbiter are presented. The engineering program was developed to achieve confidence that the design was adequate to survive the expected mission environments and to accomplish the mission objective

Dependent Covenants in Commercial Leases: \u3cem\u3eHindquarter Corp. v. Property Development Corp.\u3c/em\u3e

This Note demonstrates that the Washington Supreme Court correctly applied contract principles to the Hindquarter lease dispute. The Note first reviews the historical development of dependent covenants in both residential and commercial contexts. After setting out this important background information, the Note examines Hindquarter and the three factors that influenced the Washington Supreme Court in following the dependent covenants trend: (1) material inducements to execute the lease; (2) the intent of the parties; and (3) equity and policy considerations. The Note concludes that, even though the landlord prevailed in Hindquarter, commercial tenants stand to gain most from the supreme court\u27s decision

The chaining lemma and its application

We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called “chain” of random variables, defined by a source distribution X(0)with high min-entropy and a number (say, t in total) of arbitrary functions (T1,…, Tt) which are applied in succession to that source to generate the chain (Formula presented). Intuitively, the Chaining Lemma guarantees that, if the chain is not too long, then either (i) the entire chain is “highly random”, in that every variable has high min-entropy; or (ii) it is possible to find a point j (1 ≤ j ≤ t) in the chain such that, conditioned on the end of the chain i.e. (Formula presented), the preceding part (Formula presented) remains highly random. We think this is an interesting information-theoretic result which is intuitive but nevertheless requires rigorous case-analysis to prove. We believe that the above lemma will find applications in cryptography. We give an example of this, namely we show an application of the lemma to protect essentially any cryptographic scheme against memory tampering attacks. We allow several tampering requests, the tampering functions can be arbitrary, however, they must be chosen from a bounded size set of functions that is fixed a prior

Development of large-internal-surface-area nickel-metal plaques third quarterly progress report, dec. 19, 1964 - mar. 18, 1965

Electrodes impregnated with cadmium for porosity and electrochemical evaluatio

Daily Stress Recognition from Mobile Phone Data, Weather Conditions and Individual Traits

Research has proven that stress reduces quality of life and causes many diseases. For this reason, several researchers devised stress detection systems based on physiological parameters. However, these systems require that obtrusive sensors are continuously carried by the user. In our paper, we propose an alternative approach providing evidence that daily stress can be reliably recognized based on behavioral metrics, derived from the user's mobile phone activity and from additional indicators, such as the weather conditions (data pertaining to transitory properties of the environment) and the personality traits (data concerning permanent dispositions of individuals). Our multifactorial statistical model, which is person-independent, obtains the accuracy score of 72.28% for a 2-class daily stress recognition problem. The model is efficient to implement for most of multimedia applications due to highly reduced low-dimensional feature space (32d). Moreover, we identify and discuss the indicators which have strong predictive power.Comment: ACM Multimedia 2014, November 3-7, 2014, Orlando, Florida, US

Non-malleable codes for space-bounded tampering

Non-malleable codes—introduced by Dziembowski, Pietrzak and Wichs at ICS 2010—are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t. some class of tampering adversaries, result in a decoded value that is either identical or unrelated to the original message. Such codes are very useful for protecting arbitrary cryptographic primitives against tampering attacks against the memory. Clearly, non-malleability is hopeless if the class of tampering adversaries includes the decoding and encoding algorithm. To circumvent this obstacle, the majority of past research focused on designing non-malleable codes for various tampering classes, albeit assuming that the adversary is unable to decode. Nonetheless, in many concrete settings, this assumption is not realistic

Non-malleable encryption: simpler, shorter, stronger

In a seminal paper, Dolev et al. [15] introduced the notion of non-malleable encryption (NM-CPA). This notion is very intriguing since it suffices for many applications of chosen-ciphertext secure encryption (IND-CCA), and, yet, can be generically built from semantically secure (IND-CPA) encryption, as was shown in the seminal works by Pass et al. [29] and by Choi et al. [9], the latter of which provided a black-box construction. In this paper we investigate three questions related to NM-CPA security: 1. Can the rate of the construction by Choi et al. of NM-CPA from IND-CPA be improved? 2. Is it possible to achieve multi-bit NM-CPA security more efficiently from a single-bit NM-CPA scheme than from IND-CPA? 3. Is there a notion stronger than NM-CPA that has natural applications and can be achieved from IND-CPA security? We answer all three questions in the positive. First, we improve the rate in the scheme of Choi et al. by a factor O(λ), where λ is the security parameter. Still, encrypting a message of size O(λ) would require ciphertext and keys of size O(λ2) times that of the IND-CPA scheme, even in our improved scheme. Therefore, we show a more efficient domain extension technique for building a λ-bit NM-CPA scheme from a single-bit NM-CPA scheme with keys and ciphertext of size O(λ) times that of the NM-CPA one-bit scheme. To achieve our goal, we define and construct a novel type of continuous non-malleable code (NMC), called secret-state NMC, as we show that standard continuous NMCs are not enough for the natural “encode-then-encrypt-bit-by-bit” approach to work. Finally, we introduce a new security notion for public-key encryption that we dub non-malleability under (chosen-ciphertext) self-destruct attacks (NM-SDA). After showing that NM-SDA is a strict strengthening of NM-CPA and allows for more applications, we nevertheless show that both of our results—(faster) construction from IND-CPA and domain extension from one-bit scheme—also hold for our stronger NM-SDA security. In particular, the notions of IND-CPA, NM-CPA, and NM-SDA security are all equivalent, lying (plausibly, strictly?) below IND-CCA securit